On a sum involving powers of reciprocals of an arithmetical progression

نویسندگان

  • Hacène Belbachir
  • Abdelkader Khelladi
  • H. Belbachir
  • A. Khelladi
چکیده

Our purpose is to establish the following result: Let a and d be coprime integers and a, a+ d, a+ 2d, . . . , a+ (k − 1) d (k > 2) be an arithmetical progression. Then for all integers α0, α1, . . . , αk−1 the rational number 1/a0 + 1/ (a + d)α1 + · · · + 1/ (a + (k − 1) d)αk−1 is never an integer. This result extends theorems of Taeisinger (1915) and Kürschák (1918), and also generalizes a result of Erdős (1932).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON FINITE SUMS OF RECIPROCALS OF DISTINCT nTR POWERS

Introduction* It has long been known that every positive rational number can be represented as a finite sum of reciprocals of distinct positive integers (the first proof having been given by Leonardo Pisano [6] in 1202). It is the purpose of this paper to characterize {cf. Theorem 4) those rational numbers which can be written as finite sums of reciprocals of distinct nth. powers of integers, w...

متن کامل

Stable Laws for Sums of Reciprocals

We obtain the limiting behavior of the sum of reciprocal powers of a random sample. In particular, the mean sample reciprocal tends to a Cauchy distribution centered on the principal value (PV) of the mean population reciprocal. AMS 2000 subject classification: Primary 60E07; Secondary 60F05.

متن کامل

Sum-Rate Maximization Based on Power Constraints for Cooperative AF Relay Networks

In this paper, our objective is maximizing total sum-rate subject to power constraints on total relay transmit power or individual relay powers, for amplify-and-forward single-antenna relay-based wireless communication networks. We derive a closed-form solution for the total power constraint optimization problem and show that the individual relay power constraints optimization problem is a quad...

متن کامل

On the Sum of Reciprocals of Amicable Numbers

Two numbers m and n are considered amicable if the sum of their proper divisors, s(n) and s(m), satisfy s(n) = m and s(m) = n. In 1981, Pomerance showed that the sum of the reciprocals of all such numbers, P , is a constant. We obtain both a lower and an upper bound on the value of P .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008